/*
 * @Description: DLR前序遍历(递归和非递归)
 * @Author: zhangbo
 * @Date: 2021-04-08 12:23:20
 * @LastEditTime: 2021-04-08 12:24:22
 * @LastEditors: zhangbo
 */

/*       A
       /  \
     B     C
    /\     /
   D  E   F
  /
G

上面是给定的二叉树
 */

#include <iostream>
#include "BinaryNode.hpp"
using namespace std;

void PayTree()
{
    BinaryNode<char> *root = new BinaryNode<char>();
    root->value = 'A';
    BinaryNode<char> *temp = root;
    temp.
}

int main()
{

    return 0;
}